Classification of genus 2 curves over F2n and optimization of their arithmetic

نویسندگان

  • Bertrand Byramjee
  • Sylvain Duquesne
چکیده

To obtain efficient cryptosystems based on hyperelliptic curves, we studied genus 2 isomorphism classes of hyperelliptic curves in characteristic 2. We found general and optimal form for these curves, just as the short Weierstrass form for elliptic curves. We studied the security and the arithmetic on their jacobian. We also rewrote and optimized the formulas of Lange in characteristic 2, and we introduced a new system of coordinate. Therefore, we deduced the best form of hyperelliptic curves of genus 2 in characteristic 2 to use in cryptography.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Empirical optimization of divisor arithmetic on hyperelliptic curves over F2m

A significant amount of effort has been devoted to improving divisor arithmetic on low-genus hyperelliptic curves via explicit versions of generic algorithms. Moderate and high genus curves also arise in cryptographic applications, for example, via the Weil descent attack on the elliptic curve discrete logarithm problem, but for these curves, the generic algorithms are to date the most efficien...

متن کامل

Arithmetic Teichmuller Theory

By Grothedieck's Anabelian conjectures, Galois representations landing in outer automorphism group of the algebraic fundamental group which are associated to hyperbolic smooth curves defined over number fields encode all arithmetic information of these curves. The goal of this paper is to develope and arithmetic teichmuller theory, by which we mean, introducing arithmetic objects summarizing th...

متن کامل

Jacobians in isogeny classes of supersingular abelian threefolds in characteristic 2

We exhibit the isogeny classes of supersingular abelian threefolds over F2n containing the Jacobian of a genus 3 curve. In particular, we prove that for even n > 6 there always exist a maximal and a minimal curve over F2n . All the curves can be obtained explicitly.

متن کامل

Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity

Elliptic curves over finite fields F2n play a prominent role in modern cryptography. Published quantum algorithms dealing with such curves build on a short Weierstrass form in combination with affine or projective coordinates. In this paper we show that changing the curve representation allows a substantial reduction in the number of T -gates needed to implement the curve arithmetic. As a tool,...

متن کامل

Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2

We present an algorithm for computing the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for small odd characteristic. For a genus g hyperelliptic curve over F2n , the asymptotic running time of the algorithm is O(gn) and the space complexity is O(gn).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2004  شماره 

صفحات  -

تاریخ انتشار 2004